Multi-agent model predictive control with applications to power networks

• In Section 2.4.4. “Parallel versus serial schemes”, in the paragraph “Parallel implementation”, the following text: 2 (b) For all agents i ∈ {1, . . . , n}, at the same time, agent i solves the problem (2.21) to determine x̃i(k + 1) , ũi(k) , w̃in,ji(k) , w̃out,ji(k) , and sends to agent j ∈ Ni the computed values w̃out,ji(k) . should be replaced by 2 (b) For all agents i ∈ {1, . . . , n}, at the same time, agent i solves the problem (2.21) to determine x̃i(k + 1) , ũi(k) , w̃in,ji(k) , w̃out,ji(k) , and sends to agent j ∈ Ni the computed values w̃out,ji(k) (s) and w̃in,ji(k) . • In Section 2.4.4. “Parallel versus serial schemes”, in the paragraph “Serial implementation”, the following text: . . . and given the previous information w̃prev,ij(k) = w̃ (s−1) ij (k) of the last iteration s− 1 . . . should be replace by . . . and given the previous information w̃in,prev,ij(k) = w̃in,ij(k) , w̃out,prev,ij(k) = w̃out,ij(k) (s−1) of the last iteration s− 1 . . . • In Section 2.4.4. “Parallel versus serial schemes”, in the paragraph “Serial implementation”, the following text: (ii) 2 For all agents i = 1, . . . , n, one agent after another, agent i determines x̃i(k+1) , ũi(k) , w̃in,ji(k) , w̃out,ji(k) (s) by solving (2.21), and sends to agent j ∈ Ni the computed values w̃out,ji(k) . should be replaced by 2 (b) For all agents i = 1, . . . , n, one agent after another, agent i determines x̃i(k+1) , ũi(k) , w̃in,ji(k) , w̃out,ji(k) (s) by solving (2.21), and sends to agent j ∈ Ni the computed values w̃out,ji(k) and w̃in,ji(k).